Ramsey on Truth and Truth on Ramsey
نویسندگان
چکیده
It is widely held, to the point of being the received interpretation, that Frank Ramsey was the first to defend the so-called Redundancy Theory of Truth in his landmark article ‘Facts and Propositions’ (hereafter ‘FP’) of 1927. For instance, A.J. Ayer cited this article in the context of arguing that saying that p is true is simply a way of asserting p and that truth is not a real quality or relation. Other holders of the received interpretation, such as George Pitcher, J.L. Mackie, Susan Haack, A.C. Grayling, Nils-Eric Sahlin, Richard Kirkham, Donald Davidson and Michael Lynch credit Ramsey with having originated what they call ‘the Redundancy Theory.’ Even an authoritative source such as The Encyclopedia of Philosophy attributes this theory to him. What is more, Grover et al., in defending their Prosentential Theory of Truth, claim that their theory is an improvement and development of the Redundancy Theory, which they too attribute to Ramsey.
منابع مشابه
A Tale of two Schemata: Tarskian (Finitary) Truth and Ramseyan Mental States
I want to connect up into a coherent theory three primitive ideas which no one in their right mind would normally want to consider together. The fi rst is this: In an (1922), unpublished (seriously unpublished) typescript on Truth and Simplicity, Frank Ramsey speculated on the idea that truth is an incomplete symbol and that the claim that “‘p’ is true” can be expressed in certain linguistic co...
متن کاملThe Representational Inadequacy of Ramsey Sentences
we canvas a number of past uses of Ramsey sentences which have yielded disappointing results, and then consider three very interesting recent attempts to deploy them for a Ramseyan dialetheist theory of truth, a modal account of laws and theories, and a criterion for the existence of factual properties. we think that once attention is given to the specific kinds of theories that Ramsey had in m...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملThe strength of Ramsey Theorem for coloring relatively large sets
We characterize the computational content and the proof-theoretic strength of a Ramseytype theorem for bi-colorings of so-called exactly large sets. An exactly large set is a set X ⊂ N such that card(X) = min(X) + 1. The theorem we analyze is as follows. For every infinite subset M of N, for every coloring C of the exactly large subsets of M in two colors, there exists and infinite subset L of ...
متن کاملThe Grounds for the Model-theoretic Account of the Logical Properties
Quantificational accounts of logical truth and logical consequence aim to reduce these modal concepts to the nonmodal one of generality. A logical truth, for example, is said to be an instance of a "maximally general" statement, a statement whose terms other than variables are "logical constants." These accounts used to be the objects of severe criticism by philosophers like Ramsey and Wittgens...
متن کامل